Some Noiseless Coding Theorem Connected with Havrda and Charvat and Tsallis’s Entropy
نویسندگان
چکیده
A new measure Lα, called average code word length of order α and type β has been defined and its relationship with a result of generalized Havrda and Charvat and Tsallis’s entropy has been discussed. Using Lα, some coding theorem for discrete noiseless channel has been proved.
منابع مشابه
Some Coding Theorems Ongeneralized Havrda-charvat and Tsallis’s Entropy
∈∆N ), (1.1) where the convention 0log(0)= 0 is adapted, (see Shannon [19]). Throughout this paper, ∑ will stand for ∑N i=1 unless otherwise stated and logarithms are taken to the baseD (D > 1). Let a finite set of N input symbols X = {x1, x2, . . . ,xN } be encoded using alphabet of D symbols, then it has been shown by Feinstien [6] that there is a uniquely decipherable code with lengths n1,n2...
متن کاملNoiseless Coding Theorems Corresponding to Fuzzy Entropies
Noiseless coding theorems connected with fuzzy entropies corresponding to Shannon, Renyi and Havrada and Charvat have been established. The upper bounds of these entropies in terms of mean code word lengths have been provided and some interesting properties of these codeword lengths have been studied.
متن کاملExponential Quantum Tsallis Havrda Charvat Entropy of Type Alpha
Entropy is a key measure in studies related to information theory and its many applications. Campbell of the first time recognized that exponential of Shannon’s entropy is just the size of the sample space when the distribution is uniform. In this paper, we introduce a quantity which is called exponential Tsallis-Havrda-Charvat entropy and discuss its some properties. Further, we gave the appli...
متن کاملCoding Theorems on a Non-Additive Generalized Entropy of Havrda-Charvat And Tsallis
A new measure L , called average code word length of order and type is defined and its relationship with a generalized information measure of order and type is discussed. Using L , some coding theorems are proved.
متن کاملAn axiomatization of partition entropy
The aim of this paper is to present an axiomatization of a generalization of Shannon’s entropy starting from partitions of finite sets. The proposed axiomatization yields as special cases the Havrda-Charvat entropy, and thus, provides axiomatizations for the Shannon entropy, the Gini index, and for other types of entropy used in classification and data mining. Keywords—Shannon entropy, Gini ind...
متن کامل